Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
511	Quantum Search Algorithms arXiv:quant-ph/0504012v1 3 Apr 2005 Andris Ambainis∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-02-01 04:35:35 Computational complexity theory Quantum information science Models of computation Quantum walk Quantum computer Randomized algorithm Amplitude amplification Time complexity Decision tree model Theoretical computer science Applied mathematics Quantum algorithms
512	Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay Sriram Ramabhadran Joseph Pasquale Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2003-07-24 11:26:24 Management Round-robin scheduling Scheduling Fair queuing Weighted fair queuing Throughput Weighted round robin Fairness measure Time division multiple access Scheduling algorithms Computing Network architecture
513	Hardness amplification of weakly verifiable puzzles Ran Canetti? , Shai Halevi, and Michael Steiner IBM T.J. Watson Research Center, Hawthorne, NY, USA. [removed], [removed], [removed] Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:52 Time complexity Mathematics Applied mathematics Analysis of algorithms Chernoff bound
514	A Randomized Algorithm for Multiselection M. H. Alsuwaiyel Department of Information and Computer Science King Fahd University of Petroleum & Minerals Dhahran 31261, Saudi Arabia e-mail: [removed] Add to Reading List Source URL: eprints.kfupm.edu.sa Language: English - Date: 2011-04-06 05:04:59 Analysis of algorithms Sorting algorithms Probabilistic complexity theory Randomized algorithm Quicksort Selection algorithm Algorithm Time complexity Computational complexity theory Theoretical computer science Mathematics Applied mathematics
515	Random Sampling with a Reservoir JEFFREY SCOTT VITTER Brown University We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknown Add to Reading List Source URL: www.mathcs.emory.edu Language: English - Date: 2005-10-15 23:23:14 Analysis of algorithms Randomized algorithm Big O notation Time complexity Expectation–maximization algorithm Pseudo-random number sampling Theoretical computer science Mathematics Applied mathematics
516	Lecture XXX Page 1 “The field of mechanical theorem proving badly needs a basis for comparing and evaluating the dozens of procedures which appear in the literature. Performance of a Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-11-21 18:33:24 Complexity classes P Time complexity Algorithm Reduction Turing machine EXPTIME Computability L Theoretical computer science Computational complexity theory Applied mathematics
517	Estimating Entropy and Entropy Norm on Data Streams Amit Chakrabarti∗ Khanh Do Ba† S. Muthukrishnan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-11-10 15:56:52 Applied mathematics Entropy Streaming algorithm Time complexity Binary logarithm Big O notation Polylogarithmic Randomized algorithm Estimation theory Theoretical computer science Mathematics Analysis of algorithms
518	PDF Document Add to Reading List Source URL: www.ams.org Language: English - Date: 2011-10-25 15:14:14 Complexity classes Natural proof Alexander Razborov P Circuit complexity Steven Rudich Oracle machine Time complexity Gödel Prize Theoretical computer science Applied mathematics Computational complexity theory
519	CHAPTER 1 Decision Support Systems Revisited Because of increasing complexity, rapid change, and the escalating risks confronting managers and organizations, now is an opportune time to Add to Reading List Source URL: cdn.ttgtmedia.com Language: English - Date: 2010-09-21 11:33:50 Information science Management Decision support system Business intelligence Group decision making Executive information system Management information system Decision making Intelligent decision support systems Decision theory Information systems Information technology
520	JMLR: Workshop and Conference Proceedings[removed]–819 24th Annual Conference on Learning Theory A simple multi-armed bandit algorithm with optimal variation-bounded regret Add to Reading List Source URL: www.jmlr.org Language: English - Date: 2012-01-02 12:01:12 Operations research Machine learning Analysis of algorithms Computational complexity theory Multi-armed bandit Stochastic optimization Time complexity Algorithm Regret Theoretical computer science Applied mathematics Mathematics

UPDATE